Measuring degree-degree association in networks
نویسندگان
چکیده
منابع مشابه
Random degree-degree correlated networks
Correlations may affect propagation processes on complex networks. To analyze their effect, it is useful to build ensembles of networks constrained to have a given value of a structural measure, such as the degree-degree correlation r, being random in other aspects and preserving the degree sequence. This can be done through Monte Carlo optimization procedures. Meanwhile, when tuning r, other n...
متن کاملOn degree-degree correlations in multilayer networks
We propose a generalization of the concept of assortativity based on the tensorial representation of multilayer networks, covering the definitions given in terms of Pearson and Spearman coefficients. Our approach can also be applied to weighted networks and provides information about correlations considering pairs of layers. By analyzing the multilayer representation of the airport transportati...
متن کاملMeasuring the Degree of Virtualization
Based on the concepts of Virtual Corporation and Gradual Virtualization, we develop an instrument to measure the degree of virtualization (DV) of organizations. Virtual corporations are networks of independent companies, who cooperate to satisfy customer needs by combining their distinct core competencies. Hence, an instrument to measure the DV of a network has to integrate characteristics of c...
متن کاملDegree-degree correlations in directed networks with heavy-tailed degrees
In network theory, Pearson’s correlation coefficients are most commonly used to measure the degree assortativity of a network. We investigate the behavior of these coefficients in the setting of directed networks with heavy-tailed degree sequences. We prove that for graphs where the inand out-degree sequences satisfy a power law, Pearson’s correlation coefficients converge to a non-negative num...
متن کاملDegree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees
In network theory, Pearson’s correlation coefficients are most commonly used to measure the degree assortativity of a network. We investigate the behavior of these coefficients in the setting of directed networks with heavy-tailed degree sequences. We prove that for graphs where the inand out-degree sequences satisfy a power lawwith realistic parameters, Pearson’s correlation coefficients conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2010
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.82.037102